implementation sortings *1000

Please click on ads to support us..

Python Code:

input()









print(('1' in input().split())*-2+1)
		 						 	 				 		 		  	 	  	

C++ Code:

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
/*int solve() {
	int n, ans = -1;
	cin >> n;
	map<int, int>mp;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		mp[x]++;
		if (mp[x] >= 3)
			ans = x;
	}
	return ans;
}*/
int main()
{
	/*int t;
	cin >> t;
	while (t--) {
		cout << solve();
		cout << endl;
	}*/
	int n;
	cin >> n;
	vector<int>vec;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		vec.push_back(x);
		if (vec[i] == 1) {
			cout << -1<<endl;
			exit(0);
		}
	}
	cout << 1<<endl;
}


Comments

Submit
0 Comments
More Questions

1004B - Sonya and Exhibition
1397A - Juggling Letters
985C - Liebig's Barrels
115A - Party
746B - Decoding
1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping
237A - Free Cash
1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale
1436A - Reorder
1363C - Game On Leaves
1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot